Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
نویسندگان
چکیده
The results of an extensive search for short and moderatelength polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R = 1=4; 1=3; 1=2; and 2=3 are reported. The tail-biting representations found are typically as good as the best known block codes.
منابع مشابه
Optimal and near-optimal encoders for short and moderate-length tailbiting trellises
The results of an extensive search for short and moderatelength polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R = 1=4; 1=3; 1=2; and 2=3 are reported. The tail-biting representations found are typically as good as the best known block codes.
متن کاملA low-complexity maximum likelihood decoder for tail-biting trellis
Tail-biting trellises are defined on a circular time axis and can have a smaller number of states than equivalent conventional trellises. Existing circular Viterbi algorithms (CVAs) on the tail-biting trellis are non-convergent and sub-optimal. In this study, we show that the net path metric of each tail-biting path is lower-bounded during the decoding process of the CVA. This property can be a...
متن کاملTrellis Representations for Linear Block Codes
Trellis Representations for Linear Block Codes Heide Gluesing-Luerssen University of Kentucky Department of Mathematics 715 Patterson Office Tower Lexington, KY 40506 USA During the last decade conventional and tail-biting trellis representations of linear block codes have gained a great deal of attention. A tail-biting trellis for a block code of length n is an edge-labeled layered graph on th...
متن کاملThe structure of tail-biting trellises: minimality and basic principl
Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by e...
متن کاملUnifying Views of Tail-Biting Trellises for Linear Block Codes
This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999